Computational aspects of two-segment separable programming

Computational and Programming Aspects of Transition Elements in a Three-dimensional Finite Element Program

The performance of any finite element (FE) structural analysis is directly related to the global number of nodes and degrees of freedom (DOF) of the discretized structure and mesh distribution attributes. It is obvious that the appropriate numerical analysis needs finer elements in the zone of interest, e.g. zone of high stress concentration and intensity, and coarser elements for farther porti...

Modern Computational Applications of Dynamic Programming

Computational dynamic programming, while of some use for situations typically encountered in industrial and systems engineering, has proved to be of much greater significance in many areas of computer science. We review some of these applications here.

Polynomial Approximation for Two Stage Stochastic Programming with Separable Objective

In this paper, the authors solve the two stage stochastic programming with separable objective by obtaining convex polynomial approximations to the convex objective function with an arbitrary accuracy. Our proposed method will be valid for realistic applications, for example, the convex objective can be either non-differentiable or only accessible by Monte Carlo simulations. The resulting polyn...

Logical and Computational Aspects of Programming with Sets/Bags/Lists

We study issues that arise in programming with primitive recursion over non-free datatypes such as lists, bags and sets. Programs written in this style can lack a meaning in the sense that their outputs may be sensitive to the choice of input expression. We are, thus, naturally led to a set-theoretic denotational semantics with partial functions. We set up a logic for reasoning about the define...

Modified Gauss Elimination Technique for Separable Nonlinear Programming Problem